Directly reflective meta-programmingSTUMP, Aaron.Higher-order and symbolic computation (Print). 2009, Vol 22, Num 2, pp 115-144, issn 1388-3690, 30 p.Article

A ρ-calculus of explicit constraint applicationCIRSTEA, Horatiu; FAURE, Germain; KIRCHNER, Claude et al.Higher-order and symbolic computation. 2007, Vol 20, Num 1-2, pp 37-72, issn 1388-3690, 36 p.Article

Axioms for control operators in the CPS hierarchyKAMEYAMA, Yukiyoshi.Higher-order and symbolic computation. 2007, Vol 20, Num 4, pp 339-369, issn 1388-3690, 31 p.Article

Call-by-push-value : Decomposing call-by-value and call-by-nameBLAIN LEVY, Paul.Higher-order and symbolic computation. 2006, Vol 19, Num 4, pp 377-414, issn 1388-3690, 38 p.Article

Explicit substitutions and higher-order syntaxGHANI, Neil; UUSTALU, Tarmo; HAMANA, Makoto et al.Higher-order and symbolic computation. 2006, Vol 19, Num 2-3, pp 263-282, issn 1388-3690, 20 p.Conference Paper

Pseudo-distributive laws and axiomatics for variable bindingTANAKA, Miki; POWER, John.Higher-order and symbolic computation. 2006, Vol 19, Num 2-3, pp 305-337, issn 1388-3690, 33 p.Conference Paper

Selectors make set-based analysis too hardMEUNIER, Philippe; FINDLER, Robert Bruce; STECKLER, Paul et al.Higher-order and symbolic computation. 2005, Vol 18, Num 3-4, pp 245-269, issn 1388-3690, 25 p.Article

Bisimilarity for the region calculusHELSEN, Simon.Higher-order and symbolic computation. 2004, Vol 17, Num 4, pp 347-394, issn 1388-3690, 48 p.Article

Program synthesis from formal requirements specifications using APTSLEONARD, Elizabeth I; HEITMEYER, Constance L.Higher-order and symbolic computation. 2003, Vol 16, Num 1-2, pp 63-92, issn 1388-3690, 30 p.Article

Partial evaluation and semantics-based program manipulationDANVY, Oliver; THIEMANN, Peter.Higher-order and symbolic computation. 2003, Vol 16, Num 4, issn 1388-3690, 107 p.Serial Issue

A formalised proof of the soundness and completeness of a simply typed lambda-calculus with explicit substitutionsCOQUAND, Catarina.Higher-order and symbolic computation. 2002, Vol 15, Num 1, pp 57-90, issn 1388-3690, 34 p.Article

Special Issue on the Third ACM SIGPLAN Workshop on Continuations (CW'01)DANVY, Olivier; SABRY, Amr.Higher-order and symbolic computation. 2002, Vol 15, Num 2-3, issn 1388-3690, 127 p.Conference Proceedings

Axioms for recursion in call-by-valueHASEGAWA, Masahito; KAKUTANI, Yoshihiko.Higher-order and symbolic computation. 2002, Vol 15, Num 2-3, pp 235-264, issn 1388-3690, 30 p.Conference Paper

Higher-order uncurryingHANNAN, John; HICKS, Patrick.Higher-order and symbolic computation. 2000, Vol 13, Num 3, pp 179-216, issn 1388-3690Article

Static and dynamic program compilation by interpreter specializationTHIBAULT, Scott; CONSEL, Charles; LAWALL, Julia L et al.Higher-order and symbolic computation. 2000, Vol 13, Num 3, pp 161-178, issn 1388-3690Article

Certifying compilation and run-time code generationHORNOF, L; JIM, T.Higher-order and symbolic computation. 1999, Vol 12, Num 4, pp 337-375, issn 1388-3690Article

CPS translations and applications : The cube and beyondBARTHE, G; HATCLIFF, J; SØRENSEN, M. H. B et al.Higher-order and symbolic computation. 1999, Vol 12, Num 2, pp 125-170, issn 1388-3690Article

Computing with contextsMASON, I. A.Higher-order and symbolic computation. 1999, Vol 12, Num 2, pp 171-201, issn 1388-3690Article

Special Issue on ContinuationsDANVY, Olivier; TALCOTT, Carolyn L.Higher-order and symbolic computation. 1998, Vol 11, Num 2, issn 1388-3690, 112 p.Conference Proceedings

Continuation-Passing C, compiling threads to events through continuationsKERNELS, Gabriel; CHROBOCZEK, Juliusz.Higher-order and symbolic computation (Print). 2011, Vol 24, Num 3, pp 239-279, issn 1388-3690, 41 p.Article

Hume box calculus: robust system development through software transformationGROV, Gudmund; MICHAELSON, Greg.Higher-order and symbolic computation (Print). 2010, Vol 23, Num 2, pp 191-226, issn 1388-3690, 36 p.Article

Keeping calm in the face of change Towards optimisation of FRP by reasoning about changeSCULTHORPE, Neil; NILSSON, Henrik.Higher-order and symbolic computation (Print). 2010, Vol 23, Num 2, pp 227-271, issn 1388-3690, 45 p.Article

A minimalistic look at widening operatorsMONNIAUX, David.Higher-order and symbolic computation (Print). 2009, Vol 22, Num 2, pp 145-154, issn 1388-3690, 10 p.Article

A type-theoretic foundation of delimited continuationsARIOLA, Zena M; HERBELIN, Hugo; SABRY, Amr et al.Higher-order and symbolic computation (Print). 2009, Vol 22, Num 3, pp 233-273, issn 1388-3690, 41 p.Article

Stories about calculations: remembering Peter LandinCLARK, Tony.Higher-order and symbolic computation (Print). 2009, Vol 22, Num 4, pp 331-332, issn 1388-3690, 2 p.Article